Path ounting and random matrix theory
نویسنده
چکیده
منابع مشابه
APPLICATION OF THE RANDOM MATRIX THEORY ON THE CROSS-CORRELATION OF STOCK PRICES
The analysis of cross-correlations is extensively applied for understanding of interconnections in stock markets. Variety of methods are used in order to search stock cross-correlations including the Random Matrix Theory (RMT), the Principal Component Analysis (PCA) and the Hierachical Structures. In this work, we analyze cross-crrelations between price fluctuations of 20 company stocks...
متن کاملA Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملالگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور
Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...
متن کاملQuantized Gauge Theory on the Fuzzy Sphere as Random Matrix Model
U(n) Yang-Mills theory on the fuzzy sphere S N is quantized using random matrix methods. The gauge theory is formulated as a matrix model for a single Hermitian matrix subject to a constraint, and a potential with two degenerate minima. This allows to reduce the path integral over the gauge fields to an integral over eigenvalues, which can be evaluated for large N . The partition function of U(...
متن کاملCounting Complexity Classes
Shripad Thite May 11, 1998 Abstra t The ounting omplexity lasses are de ned in terms of the number of a epting omputation paths of nondetereministi polynomial-time Turing ma hines. They are, therefore, the ounting versions of de ision problems in NP. We review the properties of well-known ounting lasses like #P, P, GapP, SPP et . We also give an overview of the proof of Toda's theorem that rela...
متن کامل